Solving Planning Problems by Partial Deduction
نویسندگان
چکیده
We develop an abstract partial deduction method capable of solving planning problems in the Fluent Calculus. To this end, we extend \classical" partial deduction to accommodate both, equational theories and regular type information. We show that our new method is actually complete for conjunctive planning problems in the propositional Fluent Calculus. Furthermore, we believe that our approach can also be used for more complex systems, e.g., in cases where completeness can not be guaranteed due to general undecidability.
منابع مشابه
Learning in Deduction by Knowledge Migration and Shadowing
A method of deductive learning is developed to control deductive inference Our goal is to im prove problem solving time by experience when that experience monotonically adds knowledge to the knowledge base In particular for deductive reasoning systems where partial results are saved dur ing a derivation and at least some partial results are themselves deduction rules we suggest ways of taking m...
متن کاملAbstraction-Based Partial Deduction for Solving Inverse Problems - A Transformational Approach to Software Verification
ion-Based Partial Deduction for Solving Inverse Problems – A Transformational Approach to Software Verification (Extended Abstract) Robert Glück and Michael Leuschel 1 DIKU, Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen, Denmark Email: [email protected] 2 Department of Electronics and Computer Science University of Southampton, Southampton SO17 1BJ, UK Email: mal@ecs...
متن کاملAn Introduction to Partial Deduction
After several years of neglect, the importance of partial deduction (previously, partial evaluation in logic programming) as an omnipresent principle in Logic Programming, and to a certain degree in computing in general, is being recognized. This article provides a systematic introduction to partial deduction, its applications and open problems. Starting from an informal and intuitive presentat...
متن کاملDeduction-Based Refinement Planning
We introduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmement proceeds by stepwise transforming nonconstructive problem specifications into executable plans. For each refinement step there is a correctness proof guaranteeing the soundness of refinement and with that the generation of provably correct plans. By solvi...
متن کاملDeduction-based Reenement Planning
We introduce a method of deduction-based re-nement planning where prefabricated general solutions are adapted to special problems. Re-nement proceeds by stepwise transforming non-constructive problem speciications into exe-cutable plans. For each reenement step there is a correctness proof guaranteeing the soundness of reenement and with that the generation of prov-ably correct plans. By solvin...
متن کامل